Search | Engineering

Subscribe Submit

Home Journals Focus Achievement Fronts About Us 中文版

Resource Type

Journal Article 3

Year

2022 2

2021 1

Keywords

Backward unlikability 1

Decentralization 1

Group signature 1

Identity-based signature 1

Lattice 1

Lattice-based cryptography 1

Lattices 1

Post-quantum cryptography 1

Random oracle model 1

Robustness 1

Short integer solution 1

Strong unforgeability 1

Threshold proxy re-encryption 1

Verifier-local revocation 1

open ︾

Search scope:

排序： Display mode:

Identity-based threshold proxy re-encryption scheme from lattices and its applications Research Articles

Liqiang WU, Yiliang HAN, Xiaoyuan YANG, Minqing ZHANG,latticewj@163.com,hanyil@163.com

Frontiers of Information Technology & Electronic Engineering 2022, Volume 23, Issue 2, Pages 258-277 doi: 10.1631/FITEE.2000366

Abstract: (TPRE) can prevent collusion between a single proxy and a delegatee from converting arbitrary files against the wishes of the delegator through multiple proxies, and can also provide normal services even when certain proxy servers are paralyzed or damaged. A non-interactive identity-based TPRE (IB-TPRE) scheme over is proposed which removes the public key certificates. To accomplish this scheme, Shamir‘s secret sharing is employed twice, which not only effectively hides the delegator‘s private key information, but also decentralizes the proxy power by splitting the re-encryption key. means that a combiner can detect a misbehaving proxy server that has sent an invalid transformed ciphertext share. This property is achieved by lattice-based fully homomorphic signatures. As a result, the whole scheme is thoroughly capable of resisting quantum attacks even when they are available. The security of the proposed scheme is based on the decisional learning with error hardness assumption in the standard model. Two typical application scenarios, including a file-sharing system based on a blockchain network and a robust key escrow system with threshold cryptography, are presented.

Keywords： Post-quantum cryptography Threshold proxy re-encryption Lattices Robustness Decentralization

HTML PDF Collect

Novel efficient identity-based signature on lattices

Jiang-shan Chen, Yu-pu Hu, Hong-mei Liang, Wen Gao,JSChen@mnnu.edu.cn

Frontiers of Information Technology & Electronic Engineering 2021, Volume 22, Issue 2, Pages 141-286 doi: 10.1631/FITEE.1900318

Abstract: With the rapid development of electronic information technology, digital signature has become an indispensable part of our lives. Traditional public key certificate cryptosystems cannot overcome the limitations of certificate management. Identity-based cryptosystems can avoid the certificate management issues. The development of quantum computers has brought serious challenges to traditional cryptography. Post-quantum cryptography research is imperative. At present, almost all post-quantum (IBS) schemes are constructed using Gaussian sampling or trapdoor technologies. However, these two technologies have a great impact on computational efficiency. To overcome this problem, we construct an IBS scheme on s by employing Lyubashevsky’s signature scheme. Based on the shortest vector problem on s, our scheme does not use Gaussian sampling or trapdoor technologies. In the , it is proved that our scheme is strongly unforgeable against adaptive chosen messages and identity attacks. The security level of our scheme is strongly unforgeable, which is a higher level than the existential unforgeability of other schemes. Compared with other efficient schemes, our scheme has advantages in computation complexity and security.

Keywords： Identity-based signature Lattice Strong unforgeability Random oracle model

HTML PDF Collect

Verifier-local revocation group signatures with backward unlinkability from lattices Research Articles

Yanhua ZHANG, Ximeng LIU, Yupu HU, Yong GAN, Huiwen JIA

Frontiers of Information Technology & Electronic Engineering 2022, Volume 23, Issue 6, Pages 876-892 doi: 10.1631/FITEE.2000507

Abstract:

For (GS) supporting membership revocation, (VLR) mechanism seems to be a more flexible choice, because it requires only that verifiers download up-to-date revocation information for signature verification, and the signers are not involved. As a post-quantum secure cryptographic counterpart of classical number-theoretic cryptographic constructions, the first lattice-based VLR (VLR-GS) was introduced by Langlois et al. (2014). However, none of the contemporary lattice-based VLR-GS schemes provide backward unlinkability (BU), which is an important property to ensure that previously issued signatures remain anonymous and unlinkable even after the corresponding signer (i.e., member) is revoked. In this study, we introduce the first lattice-based VLR-GS scheme with BU security (VLR-GS-BU), and thus resolve a prominent open problem posed by previous works. Our new scheme enjoys an (log) factor saving for bit-sizes of the group public-key (GPK) and the member's signing secret-key, and it is free of any public-key encryption. In the random oracle model, our scheme is proven secure under two well-known hardness assumptions of the (SIS) problem and learning with errors (LWE) problem.

Keywords： Group signature Lattice-based cryptography Verifier-local revocation Backward unlikability Short integer solution